Rajeev Motwani (1962-2009)

Combining Register Allocation and Instruction Scheduling (Technical Summary)

Introduction to Privacy-Preserving Data Publishing: Concepts and Techniques

On Sampling and Relational Operators

A major bottleneck in implementing sampling as a primitive relational operation is the inefficiency of sampling the output of a query. We highlight the primary difficulties, summarize the results of some recent work in this area, and indicate directions for future work.

Lecture Notes on Approximation Algorithms Volume I

These lecture notes are based on the course CS351 (Dept. of Computer Science, Stanford University) o ered during the academic year 1991-92. The notes below correspond to the rst half of the course. The second half consists of topics such as MAX SNP, cliques, and colorings, as well as more specialized material covering topics such as geometric problems, Steiner trees and multicommodity ows. The ...

Storage Management for Evolving Databases

The problem of maintaining data that arrives continuously over time is increasingly prevalent in databases and digital libraries. Building on a model for sliding-window indices developed in [24], we devise efcient algorithms for some of the central problems that arise. We also show connections between the problems in this model and some fundamental problems in optimization and graph theory.